Weakly Regular Subdivisions

Recursively-regular subdivisions and applications

We generalize the notion of regular polyhedral subdivision of a point (or vector) configuration in a new direction. This is done after studying some related objects, like the finest regular coarsening and the regularity tree of a subdivision. Properties of these two objects are derived, which confer more structure to the class of non-regular subdivisions, relating them to its (in a sense) close...

The finest regular coarsening and recursively-regular subdivisions

We generalize the notion of regular polyhedral subdivision of a point (or vector) configuration in a new direction. This is done after studying some related objects, like the finest regular coarsening and the regularity tree of a subdivision. Properties of these two objects are derived, which confer more structure to the class of non-regular subdivisions, relating them to its (in a sense) close...

Weakly Distance-regular Digraphs

Pairwise Weakly Regular-Lindelöf Spaces

We will introduce and study the pairwise weakly regular-Lindelöf bitopological spaces and obtain some results. Furthermore, we study the pairwise weakly regular-Lindelöf subspaces and subsets, and investigate some of their characterizations. We also show that a pairwise weakly regularLindelöf property is not a hereditary property. Some counterexamples will be considered in order to establish so...

Weakly and Strongly Irreversible Regular Languages

Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible languages, respectively. The existence of k-reversible languages which are not (k−1)-reversible is known, for each k > 1. This gives an infinite hierarchy o...